GRASP and VNS for Max-Cut
نویسندگان
چکیده
In this abstract, we study GRASP and VNS heuristics for Max-Cut, together with a combination of the two in a hybrid procedure. GRASP [3, 4, 5] is characterized by a construction phase and a local search phase. The iterative construction builds a solution, one element at a time, randomly selected from a restricted candidate list (RCL), whose elements are well-ranked according to a greedy function. Once a feasible solution is obtained, a local search procedure tries to improve it producing a solution that is locally optimal with respect to the specified neighborhood structure. The construction and the local search phases are repeatedly applied, and the best solution found is kept as an approximation of the optimal. VNS [9] is based on the exploration of a dynamic neighborhood model.
منابع مشابه
Randomized heuristics for the Max-Cut problem
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized. It is a well-known NP-hard problem with applications in several fields, including VLSI design and statistical physics. In this paper, a greedy randomized adaptive search p...
متن کاملA VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section
A heuristic algorithm based on VNS is proposed to solve the Max 3-cut and Max 3-section problems. By establishing a neighborhood structure of the Max 3-cut problem, we propose a local search algorithm and a variable neighborhood global search algorithm with two stochastic search steps to obtain the global solution. We give some numerical results and comparisons with the well-known 0.836-approxi...
متن کاملHigh-Performance VNS for the Max-Cut Problem using Commodity Graphics Hardware
The Max-Cut problem consists of finding a partition of the graph nodes into two subsets, such that the sum of the edge weights having endpoints in different subsets is maximized. This NPhard problem for non planar graphs has different applications in areas such as VLSI and ASIC design. In the last decade, consumer graphics cards (GPUs) have increased their power due to the computer games indust...
متن کاملAn experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. This paper reviews three VNS strategies for finding near-optimal solutions for vertex-cut minimizati...
متن کاملGRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection
This paper considers the planning of the collection of fresh milk from local farms with a fleet of refrigerated vehicles. The problem is formulated as a version of the Periodic Vehicle Routing Problem with Time Windows. The objective function is oriented to the quality of service by minimizing the service times to the customers within their time windows. We developed a hybrid metaheuristic that...
متن کامل